Total interval number for graphs with bounded degree
نویسندگان
چکیده
منابع مشابه
Total interval number for graphs with bounded degree
The total interval number of an n-vertex graph with maximum degree ∆ is at most (∆+1/∆)n/2, with equality if and only if every component of the graph is K∆,∆. If the graph is also required to be connected, then the maximum is ∆n/2+1 when ∆ is even, but when ∆ is odd it exceeds [∆+1/(2.5∆+7.7)]n/2 for infinitely many n. c © 1997 John Wiley & Sons, Inc. J Graph Theory 25: 79–84, 1997
متن کاملk-forested choosability of graphs with bounded maximum average degree
A proper vertex coloring of a simple graph is $k$-forested if the graph induced by the vertices of any two color classes is a forest with maximum degree less than $k$. A graph is $k$-forested $q$-choosable if for a given list of $q$ colors associated with each vertex $v$, there exists a $k$-forested coloring of $G$ such that each vertex receives a color from its own list. In this paper, we prov...
متن کاملSparse universal graphs for bounded-degree graphs
Let H be a family of graphs. A graph T is H-universal if it contains a copy of each H ∈ H as a subgraph. Let H(k, n) denote the family of graphs on n vertices with maximum degree at most k. For all positive integers k and n, we construct an H(k, n)-universal graph T with Ok(n 2 k log 4 k n) edges and exactly n vertices. The number of edges is almost as small as possible, as Ω(n2−2/k) is a lower...
متن کاملOn the Number of Hamilton Cycles in Bounded Degree Graphs
The main contribution of this paper is a new approach for enumerating Hamilton cycles in bounded degree graphs – deriving thereby extremal bounds. We describe an algorithm which enumerates all Hamilton cycles of a given 3-regular n-vertex graph in time O(1.276), improving on Eppstein’s previous bound. The resulting new upper bound of O(1.276) for the maximum number of Hamilton cycles in 3-regul...
متن کاملCrossing Number for Graphs with Bounded~Pathwidth
The crossing number is the smallest number of pairwise edge-crossings when drawing a graph into the plane. There are only very few graph classes for which the exact crossing number is known or for which there at least exist constant approximation ratios. Furthermore, up to now, general crossing number computations have never been successfully tackled using bounded width of graph decompositions,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Theory
سال: 1997
ISSN: 0364-9024,1097-0118
DOI: 10.1002/(sici)1097-0118(199705)25:1<79::aid-jgt5>3.0.co;2-f